Stable Computation of the Complex Roots of Unity Stable Computation of the Complex Roots of Unity
نویسنده
چکیده
In this paper, we show that the problem of computing the complex roots of unity is not as simple as it seems at rst. In particular, the formulas given in a standard programmer's reference book Knuth, Seminumerical Algorithms, 1981] are shown to be numerically unstable, giving unacceptably large error for moderate sized sequences. We give alternative formulas, which we show to be superior both by analysis and experiment.
منابع مشابه
Stable computation of the complex roots of unity
In this paper, we show that the problem of computing the complex roots of unity is not as simple as it seems at rst. In particular, the formulas given in a standard programmer's reference book Knuth, Seminumerical Algorithms, 1981] are shown to be numerically unstable , giving unacceptably large error for moderate sized sequences. We give alternative formulas, which we show to be superior both ...
متن کاملROOTS OF UNITY AND THE ADAMS-NOVIKOV SPECTRAL SEQUENCE FOR FORMAL yl-MODULES
The cohomology of a Hopf algebroid related to the Adams-Novikov spectral sequence for formal ,4-modules is studied in the special case in which A is the ring of integers in the field obtained by adjoining pth roots of unity to Qp , the p-adic numbers. Information about these cohomology groups is used to give new proofs of results about the E2 term of the Adams spectral sequence based on 2-local...
متن کاملA STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
متن کاملCrystal Bases of Quantum Affine Algebras and Affine Kazhdan-lusztig Polynomials
We present a fast version of the algorithm of Lascoux, Leclerc, and Thibon for the lower global crystal base for the Fock representation of quantum affine sln. We also show that the coefficients of the lower global crystal base coincide with certain affine KazhdanLusztig polynomials. Our algorithm allows fast computation of decomposition numbers for tilting modules for quantum slk at roots of u...
متن کاملProbabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomial have some error, and all values are represented in standard, fixed-precision, floating-point arithmetic. By interpolating the black box evaluated at random primitive roots of unity, we give an efficient and numerica...
متن کامل